The 2-Center Problem in Chordal Graphs
نویسندگان
چکیده
In a graph G, the p-center problem is to identify p vertices of G for locating some kind of facilities such that the maximum among the distances from all vertices to their nearest facility is minimized. In this paper, we propose an O(n)-time algorithm for computing a 2-center in a chordal graph with maximum degree at most three, where a graph is chordal if every induced cycle of length at least four has a chord, and n is the number of vertices in the graph.
منابع مشابه
Complement of Special Chordal Graphs and Vertex Decomposability
In this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially Cohen-Macaulay.
متن کاملOn Chordal-k-Generalized Split Graphs
A graph G is a chordal-k-generalized split graph if G is chordal and there is a clique Q in G such that every connected component in G[V \ Q] has at most k vertices. Thus, chordal-1-generalized split graphs are exactly the split graphs. We characterize chordal-k-generalized split graphs by forbidden induced subgraphs. Moreover, we characterize a very special case of chordal-2-generalized split ...
متن کاملThe Existence of Homeomorphic Subgraphs in Chordal Graphs
We establish conditions for the existence, in a chordal graph, of subgraphs homeomorphic to Kn (n ≥ 3), Km,n (m,n ≥ 2), and wheels Wr (r ≥ 3). Using these results, we develop a simple linear time algorithm for testing planarity of chordal graphs. We also show how these results lead to simple polynomial time algorithms for the Fixed Subgraph Homeomorphism problem on chordal graphs for some speci...
متن کاملSolving the All-Pairs-Shortest-Lengt Problem on Chordal Bipartite Graphs
The all-pairs-shortest-length (APSL) problem of a graph is to nd the lengths of the shortest paths between all pairs of vertices. In this paper, we study the APSL problem on chordal bipartite graphs. By a simple reduction, we show that solving the APSL problem on chordal bipartite graphs can be transformed to solving the same problem on certain strongly chordal graphs. Consequently, there is an...
متن کاملList Partitions of Chordal Graphs
In an earlier paper we gave efficient algorithms for partitioning chordal graphs into k independent sets and l cliques. This is a natural generalization of the problem of recognizing split graphs, and is NPcomplete for graphs in general, unless k ≤ 2 and l ≤ 2. (Split graphs have k = l = 1.) In this paper we expand our focus and consider generalM -partitions, also known as trigraph homomorphism...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012